An Efficient Partial Sums Generator for Constituent Code based Successive Cancellation Decoding of Polar Codes
نویسندگان
چکیده
This paper proposes the architecture of partial sum generator for constituent codes based polar code decoder. Constituent codes based polar code decoder has the advantage of low latency. However, no purposefully designed partial sum generator design exists that can yield desired timing for the decoder. We first derive the mathematical presentation with the partial sums set βc which is corresponding to each constituent codes. From this, we concoct a shift-register based partial sum generator. Next, the overall architecture and design details are described, and the overhead compared with conventional partial sum generator is evaluated. Finally, the implementation results with both ASIC and FPGA technology and relevant discussions are presented.
منابع مشابه
Implementation of Polar Code Decoders
In this report, we review the construction of polar codes and we briefly present the main results that lead to the conclusion that polar codes are capacity achieving over binaryinput discrete memoryless channels. Moreover, we discuss a more sophisticated variant of successive cancellation decoding, namely list successive cancellation decoding, that aims to improve the finite-length performance ...
متن کاملAn Encoding Scheme with Constituent Codes Optimization for Polar Code-Aim to Reduce the Decoding Latency
This paper proposes a polar code construction scheme that reduces constituent-code supplemented decoding latency. Constituent codes are the sub-codewords with specific patterns. They are used to accelerate the successive cancellation decoding process of polar code without any performance degradation. We modify the traditional construction approach to yield increased number of desirable constitu...
متن کاملAn Efficient, Portable and Generic Library for Successive Cancellation Decoding of Polar Codes
Error Correction Code decoding algorithms for consumer products such as Internet of Things (IoT) devices are usually implemented as dedicated hardware circuits. As processors are becoming increasingly powerful and energy efficient, there is now a strong desire to perform this processing in software to reduce production costs and time to market. The recently introduced family of Successive Cance...
متن کاملSoft-decision decoding of polar codes with Reed-Solomon kernels
The problem of efficient soft-decision decoding of polar codes with ReedSolomon kernel is considered. A decomposition of the kernel based on the cyclotomic FFT algorithm is proposed, which enables one to implement near-optimal evaluation of log-likelihood ratios in the successive cancellation decoding algorithm.
متن کاملCapacity-Achievability of Polar Codes under Successive Cancellation List Decoding
Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\i}kan. The performance of the successive cancellation list decoder is encou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1611.09452 شماره
صفحات -
تاریخ انتشار 2016